Repeated sorting on the sliding window for OS‐CFAR
نویسندگان
چکیده
منابع مشابه
On Sliding Window Schemes For DiscreteLeast
Fast, eecient, and reliable algorithms for up-and downdating discrete least-squares approximations of a real-valued function given at arbitrary distinct nodes in 0; 2) by trigonometric polynomials are presented. A combination of the up-and downdating algorithms yields a sliding window scheme. The algorithms are based on schemes for the solution of (inverse) unitary eigenproblems and require onl...
متن کاملOn Sliding Window Schemes For DiscreteLeast - Squares
Fast, eecient, and reliable algorithms for up-and downdating discrete least-squares approximations of a real-valued function given at arbitrary distinct nodes in 0; 2) by trigonometric polynomials are presented. A combination of the up-and downdating algorithms yields a sliding window scheme. The algorithms are based on schemes for the solution of (inverse) unitary eigenproblems and require onl...
متن کاملSliding Window Logic Simulation
Existing digital logic simulators typically depend on a discrete-time model of circuit behaviour. Whilst this approach is sufficient in many cases for the validation of the behaviour of synchronous circuits, it is not good at identifying glitches that are narrower than the available time resolution. Moreover, it is not generally feasible to accommodate uncertainty in delay time in such a way as...
متن کاملSkip-Sliding Window Codes
Constrained coding is used widely in digital communication and storage systems. In this paper, we study a generalized sliding window constraint called the skip-sliding window. A skip-sliding window (SSW) code is defined in terms of the length L of a sliding window, skip length J , and cost constraint E in each sliding window. Each valid codeword of length L+kJ is determined by k+1 windows of le...
متن کاملA note on general sliding window processes
Let f : R → [r] = {1, 2, . . . , r} be a measurable function, and let {Ui}i∈N be a sequence of i.i.d. random variables. Consider the random process Zi = f(Ui, ..., Ui+k−1). We show that for all q, there is a positive probability, uniform in f , that Z1 = Z2 = ... = Zq. A continuous counterpart is that if f : R → R, and Ui and Zi are as before, then there is a positive probability, uniform in f ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Radar, Sonar & Navigation
سال: 2019
ISSN: 1751-8792,1751-8792
DOI: 10.1049/iet-rsn.2018.5507